An iterated local search for a multi‐period orienteering problem arising in a car patrolling application
نویسندگان
چکیده
Abstract This paper addresses a real‐world multi‐period orienteering problem arising in large Italian company that needs to patrol an area order provide security services set of customers. Each customer requires different on weekly basis. Some are mandatory, while others optional. It might be impossible perform all optional services, and each them is assigned score when performed. The challenge determine routes, one per day, maximizes weighted sum the total collected working time, meeting several operational constraints, including hard time windows, maximum riding minimum number performed, between two consecutive visits for same service at customer. To solve problem, we propose iterated local search invokes iteration inner variable neighborhood descent procedure. Computational tests performed instances prove developed algorithm very efficient, finds short solutions consistently better than those produced by mathematical model, use company.
منابع مشابه
Solving multi-objective team orienteering problem with time windows using adjustment iterated local search
One of the problems tourism faces is how to make itineraries more effective and efficient. This research has solved the routing problem with the objective of maximizing the score and minimizing the time needed for the tourist’s itinerary. Maximizing the score means collecting a maximum of various kinds of score from each destination that is visited. The profits differ according to whether those...
متن کاملAn Iterated Local Search Algorithm for Solving the Orienteering Problem with Time Windows
The Orienteering Problem with Time Windows (OPTW) is a variant of the Orienteering Problem (OP). Given a set of nodes including their scores, service times and time windows, the goal is to maximize the total of scores collected by a particular route considering a predefined time window during which the service has to start. We propose an Iterated Local Search (ILS) algorithm to solve the OPTW, ...
متن کاملan application of fuzzy logic for car insurance underwriting
در ایران بیمه خودرو سهم بزرگی در صنعت بیمه دارد. تعیین حق بیمه مناسب و عادلانه نیازمند طبقه بندی خریداران بیمه نامه براساس خطرات احتمالی آنها است. عوامل ریسکی فراوانی می تواند بر این قیمت گذاری تاثیر بگذارد. طبقه بندی و تعیین میزان تاثیر گذاری هر عامل ریسکی بر قیمت گذاری بیمه خودرو پیچیدگی خاصی دارد. در این پایان نامه سعی در ارائه راهی جدید برای طبقه بندی عوامل ریسکی با استفاده از اصول و روش ها...
An application of Iterated Local Search to Graph Coloring Problem
Graph coloring is a well known problem from graph theory that, when solving it with local search algorithms, is typically treated as a series of constraint satisfaction problems: for a given number of colors k, one has to find a feasible coloring; once such a coloring is found, the number of colors is decreased and the local search starts again. Here we explore the application of Iterated Local...
متن کاملIterated local search heuristic for the team orienteering problem with time windows
Tourists have the difficult task to schedule their holiday activities in such a way that they enjoy their holiday as much as possible, while keeping the opening times and exact locations of attractions in mind. This task can be formulated as the team orienteering problem with time windows (TOPTW). The TOPTW uses a list of locations as input, together with their opening times and appreciation sc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Networks
سال: 2023
ISSN: ['0028-3045', '1097-0037']
DOI: https://doi.org/10.1002/net.22187